Implementing Explanation-Based Argumentation using Answer Set Programming
نویسندگان
چکیده
This paper presents an implementation for an explanationbased theory of argumentation. Instead of referring to attack/support relationships between arguments, as in traditional argumentation theories, we focus on the relation of messages with the space of hypothetical explanations. The consequences of this choice are two-fold. First, attack and support relationships become derivative measures. Second, we unveil a natural integration with probabilistic reasoning. The proposed operationalization is based on stable models semantics for logic programming.
منابع مشابه
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
The system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung’s argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input, and uses the answer-set solver DLV for computing the type of extension specified by the user.
متن کاملImplementing Instantiation of Knowledge Bases in Argumentation Frameworks
We present an implementation of Wyner, Bench-Capon and Dunne’s [2013] approach to instantiate knowledge bases in argumentation frameworks. The translation is encoded into answer set programming (ASP); the encoding can be used with ASP-based implementations of argumentation frameworks, such as ASPARTIX or DIAMOND.
متن کاملArgumentation for Answer Set Programming and other Non-monotonic Reasoning Systems
During my PhD I will compare various non-monotonic reasoning systems and analyse their advantages as well as their shortcomings. This will lead to the combination of different approaches in order to overcome their individual deficiencies and create more powerful reasoning tools. A special focus will be on preference-handling strategies in these non-monotonic reasoning systems. My current work i...
متن کاملJustifying answer sets using argumentation
An answer set is a plain set of literals which has no further structure that would explain why certain literals are part of it and why others are not. We show how argumentation theory can help to explain why a literal is or is not contained in a given answer set by defining two justification methods, both of which make use of the correspondence between answer sets of a logic program and stable ...
متن کاملArgumentation and Answer Set Programming
Argumentation and answer set programming are the two main knowledge representation paradigms emerged from logic programming for non-monotonic reasoning. This paper surveys recent work on using answer set programming as a mechanism for computing extensions in argumentation. The paper also indicates some directions for future work.
متن کامل